The Cauchy–Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels
نویسندگان
چکیده
This paper contributes a tutorial level discussion of some interesting properties of the recent Cauchy–Schwarz (CS) divergence measure between probability density functions. This measure brings together elements from several different machine learning fields, namely information theory, graph theory and Mercer kernel and spectral theory. These connections are revealed when estimating the CS divergence non-parametrically using the Parzen window technique for density estimation. An important consequence of these connections is that they enhance our understanding of the different machine learning schemes relative to each other. r 2006 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
منابع مشابه
A Dissertation for the Degree of Doctor Scientiarum An Information Theoretic Approach to Machine Learning
In this thesis, theory and applications of machine learning systems based on information theoretic criteria as performance measures are studied. A new clustering algorithm based on maximizing the Cauchy-Schwarz (CS) divergence measure between probability density functions (pdfs) is proposed. The CS divergence is estimated non-parametrically using the Parzen window technique for density estimati...
متن کاملA Convex Cauchy-Schwarz DivergenceMeasure for Blind Source Separation
Independent Component Analysis (ICA) for the demixing of multiple source mixtures. We call it the Convex Cauchy-Schwarz Divergence (CCS-DIV), and it is formed by integrating convex functions into the Cauchy-Schwarz inequality. The new measure is symmetric and the degree of its curvature with respect to the joint-distribution can be tuned by a (convexity) parameter. The CCS-DIV is able to speed-...
متن کاملComparison of Entropy and Mean Square Error Criteria in Adaptive System Training Using Higher Order Statistics
The error-entropy-minimization approach in adaptive system training is addressed in this paper. The effect of Parzen windowing on the location of the global minimum of entropy has been investigated. An analytical proof that shows the global minimum of the entropy is a local minimum, possibly the global minimum, of the nonparametrically estimated entropy using Parzen windowing with Gaussian kern...
متن کاملSchwarz boundary problem on a triangle
In this paper, the Schwarz boundary value problem (BVP) for the inhomogeneous Cauchy-Riemann equation in a triangle is investigated explicitly. Firstly, by the technique of parquetingreflection and the Cauchy-Pompeiu representation formula a modified Cauchy-Schwarz representation formula is obtained. Then, the solution of the Schwarz BVP is explicitly solved. In particular, the boundary behavio...
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کامل